Interactive Verifiable Polynomial Evaluation

Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks strong but untrusted servers. Verifiable algorithms help build trust in such interactions by enabling server provide a proof of correctness his results which user can check very efficiently. In this article, we present doubly-efficient interactive algorithm verifiable polynomial evaluation. Unlike mainstream literature on computing, soundness our is information-theoretic and cannot be broken unbounded server. By relying basic properties error correcting codes, enforces dishonest false problems become progressively easier verify. After roughly $\log d$ rounds, verify response against look-up table that has been pre-computed during an initialization phase. For degree $d$ , achieve complexity $O(d^{\epsilon })$ $O(d^{1+\epsilon round $O(\log d)$ .